The chromatic numbers of random hypergraphs
نویسندگان
چکیده
For a pair of integers 1Fgr, the g-chromatic number of an r-uniform Ž . hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < < T , . . . , T such that elT Fg for every egE. In this paper we determine the asymptotic 1 k i Ž . behavior of the g-chromatic number of the random r-uniform hypergraph H n, p for all r Ž yrq1. possible values of g and for all values of p down to psQ n . Q 1998 John Wiley & Sons, Inc. Random Struct. Alg., 12, 381]403, 1998
منابع مشابه
no-homomorphism conditions for hypergraphs
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
متن کاملOn The Choice Number Of Random Hypergraphs
We generalize the notion of choice number from graphs to hypergraphs and estimate the sharp order of magnitude of the choice number of random hypergraphs. It turns out that the choice number and the chromatic number of a random hypergraph have the same order of magnitude, almost surely. Our result implies an earlier bound on the chromatic number of random hypergraphs, proved by Schmidt [Sch] us...
متن کاملStar chromatic numbers of hypergraphs and partial Steiner triple systems
The concept of star chromatic number of a graph, introduced by Vince (1988) is a natural generalization of the chromatic number of a graph. This concept was studied from a pure combinatorial point of view by Bondy and Hell (1990). In this paper we introduce strong and weak star chromatic numbers of uniform hypergraphs and study their basic properties. In particular, we focus on partial Steiner ...
متن کاملConstructions of sparse uniform hypergraphs with high chromatic number
Arandomconstruction gives newexamples of simple hypergraphswith high chromatic number that have few edges and/or lowmaximumdegree. In particular, for every integers k ≥ 2, r ≥ 2, and g ≥ 3, there exist r-uniform non-k-colorable hypergraphs of girth at least g with maximum degree at most r kr−1 ln k . This is only 4r2 ln k times greater than the lower bound by Erdős and Lovász (ColloquiaMath Soc...
متن کاملRandom Kneser graphs and hypergraphs
A Kneser graph KGn,k is a graph whose vertices are all k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n − 2k + 2. In this paper we discuss the chromatic number of random Kneser graphs and hypergraphs. It was studied in two recent paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 12 شماره
صفحات -
تاریخ انتشار 1998